Fast Broadcasting and Gossiping in Radio Networks
نویسندگان
چکیده
We establish an O(n log2 n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of (n logn). The fastest previously known algorithm for this problem works in time O(n3=2). Using our broadcasting algorithm, we develop an O(n3=2 log2 n) algorithm for gossiping in the same network model.
منابع مشابه
On Randomized Broadcasting and Gossiping in Radio Networks
This paper has two parts. In the first part we give an alternative (and much simpler) proof for the best known lower bound of Ω(D log (N/D)) for randomized broadcasting in radio networks with unknown topology. In the second part we give an O(N log N)-time randomized algorithm for gossiping in such radio networks. This is an improvement over the fastest previously known algorithm that works in t...
متن کاملFaster Centralized Communication in Radio Networks
We study the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that gossiping can be completed in O(D+ Δ log n logΔ−log log n ) time units in any ra...
متن کاملGossiping with Bounded Size Messages in ad hoc Radio Networks
We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n)-gossiping. We show that √ n-gossiping in an ad hoc radio network on...
متن کاملDeterministic Broadcasting and Gossiping with Beeps
Broadcasting and gossiping are fundamental communication tasks in networks. In broadcasting, one node of a network has a message that must be learned by all other nodes. In gossiping, every node has a (possibly different) message, and all messages must be learned by all nodes. We study these well-researched tasks in a very weak communication model, called the beeping model. Communication procee...
متن کاملTime Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a deterministic algorithm for the gossiping problem that works in at most n units of time in any radio network of size n. This is an optimal algorithm in the sense that there exist radio network topologies, such as: a line...
متن کامل